On Voronoi Diagrams in the Planar Line Space and Their Generalizations
نویسندگان
چکیده
We describe the structure of the Voronoi diagram of lines for a set of points in the plane, thereby making use of an extra dimension. In contrast to previous results in this respect, which were based on the dual representation of the Voronoi diagram under consideration, our approach applies to the primal plane. We also generalize it to higher-dimensional hyperplane spaces.
منابع مشابه
Mobile Robot Online Motion Planning Using Generalized Voronoi Graphs
In this paper, a new online robot motion planner is developed for systematically exploring unknown environ¬ments by intelligent mobile robots in real-time applications. The algorithm takes advantage of sensory data to find an obstacle-free start-to-goal path. It does so by online calculation of the Generalized Voronoi Graph (GVG) of the free space, and utilizing a combination of depth-first an...
متن کاملRobot Motion Planning Using Generalised Voronoi Diagrams
In robot motion planning in a space with obstacles, the goal is to find a collision-free path of robot from the starting to the target position. There are many fundamentally different approaches, and their modifications, to the solution of this problem depending on types of obstacles, dimensionality of the space and restrictions for robot movements. Among the most frequently used are roadmap me...
متن کاملOn the Hausdorff and Other Cluster Voronoi Diagrams
The Voronoi diagram is a fundamental geometric structure that encodes proximity information. Given a set of geometric objects, called sites, their Voronoi diagram is a subdivision of the underlying space into maximal regions, such that all points within one region have the same nearest site. Problems in diverse application domains (such as VLSI CAD, robotics, facility location, etc.) demand var...
متن کاملStraight Skeletons for General Polygonal
A novel type of skeleton for general polygonal gures, the straight skeleton S(G) of a planar straight line graph G, is introduced and discussed. Exact bounds on the size of S(G) are derived. The straight line structure of S(G) and its lower combinatorial complexity may make S(G) preferable to the widely used Voronoi diagram (or medial axis) of G in several applications. We explain why S(G) has ...
متن کاملNew Results on Abstract Voronoi Diagrams
Voronoi diagrams are a fundamental structure used in many areas of science. For a given set of objects, called sites, the Voronoi diagram separates the plane into regions, such that points belonging to the same region have got the same nearest site. This definition clearly depends on the type of given objects, they may be points, line segments, polygons, etc. and the distance measure used. To f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Trans. Computational Science
دوره 20 شماره
صفحات -
تاریخ انتشار 2013